transition functions造句
例句與造句
- to compute the transition function
中的算法來計(jì)算轉(zhuǎn)換函數(shù)。 - you can represent the transition function as a two dimensional matrix,
可以將轉(zhuǎn)換函數(shù)表示為兩維矩陣 - finite-state vector quantization; lpc cepstral coefficients; dynamic spectral feature; dynamic time warpping; state transition function
有限狀態(tài)矢量量化lpc倒譜系數(shù)動(dòng)態(tài)譜特性動(dòng)態(tài)規(guī)整狀態(tài)轉(zhuǎn)移函數(shù) - the requirements of the initial system state and the secure system state are put forward and 21 transition functions are defined in this dissertation
給出了初始系統(tǒng)狀態(tài)和系統(tǒng)的安全狀態(tài)要求，定義了21個(gè)狀態(tài)轉(zhuǎn)換函數(shù)。 - in other words, to build the dfa, you need to allocate as many states as there are possible stack configurations and compute the transition function between all these states
換句話說，要構(gòu)建dfa，需要分配的狀態(tài)數(shù)量與可能的堆棧配置數(shù)量相同，并且需要計(jì)算所有這些狀態(tài)間的轉(zhuǎn)換函數(shù)。 - It's difficult to find transition functions in a sentence. 用transition functions造句挺難的
- invariant distribution is a greatly important property of standard transition function in continuous-time markov chains and jump processes, it is of considerably significnce to study it
不變分布是連續(xù)時(shí)間馬氏鏈中標(biāo)準(zhǔn)轉(zhuǎn)移函數(shù)及跳過程的一個(gè)重要性質(zhì)，對(duì)不變分布的討論有著十分重要的意義。 - on the base of li's paper [ 41 ], we first discuss the relationships between q-matrix q and the generators of positive once integrated semigroups on derived from transition functions
li41的基礎(chǔ)上，我們首先討論由轉(zhuǎn)移函數(shù)導(dǎo)出的l。上的正的一次壓縮半積分群的生成元與q矩陣q之間的關(guān)系；其次，我們?cè)撚懻搯栴}的反面：給定l。 - 2 ) we put up the experiments mainly based on the cpld for the faults emulation on some typical digital circuits . and we built the transition function databases according to the faulty testing results
2、以cpld為核心進(jìn)行了一些典型數(shù)字電路的故障模擬仿真試驗(yàn)，建立被測電路的狀態(tài)轉(zhuǎn)移函數(shù)集，為進(jìn)一步研究電路的可測試性和故障診斷提供了數(shù)據(jù)。 - an easy checking criterion for a minimal monotone transition function to be strongly ergodic is then obtained . we further prove that a non-minimal ergodic monotone transition function is always strongly ergodic
對(duì)于最小隨機(jī)單調(diào)轉(zhuǎn)移函數(shù)的強(qiáng)遍歷，給出了非常容易檢驗(yàn)的準(zhǔn)則，此外，我們還證明了非最小隨機(jī)單調(diào)轉(zhuǎn)移函數(shù)強(qiáng)遍歷當(dāng)且僅當(dāng)它是遍歷的。 - an easy checking criterion for a minimal monotone transition function to be strongly ergodic is then obtained . we further prove that a non-minimal ergodic monotone transition function is always strongly ergodic
對(duì)于最小隨機(jī)單調(diào)轉(zhuǎn)移函數(shù)的強(qiáng)遍歷，給出了非常容易檢驗(yàn)的準(zhǔn)則，此外，我們還證明了非最小隨機(jī)單調(diào)轉(zhuǎn)移函數(shù)強(qiáng)遍歷當(dāng)且僅當(dāng)它是遍歷的。 - 4 ) in this paper, according to the transition function databases we got the minimum test set using the graph theory . and later we built the quick test databases and the fault diagnosis databases
4、重點(diǎn)研究了利用圖論中的基本回路概念根據(jù)狀態(tài)轉(zhuǎn)移函數(shù)集尋找電路的最小測試集，然后利用所得的最小測試集建立相應(yīng)電路的快速測試數(shù)據(jù)庫和故障診斷字典。 - the algorithm processes the set of xpaths and compiles three things : a set of states that the transition diagram might go through, the transition function to move from one state to another, and an indication of which states mark successful recognition of an xpath
該算法處理這組xpath，并編譯三樣?xùn)|西：轉(zhuǎn)換圖可能經(jīng)過的一組狀態(tài)，從一種狀態(tài)遷移到另一種狀態(tài)的轉(zhuǎn)換函數(shù)，以及表明哪些狀態(tài)成功地識(shí)別了xpath的標(biāo)記。 - li in [ 41 ] has discussed the properties of transition functions on and obtained that a generally unlimited q-matrix q can generate a positive once integrated semigroup with contractions on up to now, it is the first time to apply the theories of integrated semigroups to ctmcs
上的性質(zhì)，得出一般的無界q矩陣q在l。上能生成正的一次壓縮積分半群迄今為止，這是首次應(yīng)用積分半群的理論來研究時(shí)間連續(xù)markov鏈 - then we also formulate the model of computing with values via lattice-valued finite state automata, as well as the state transition function of the model of computing with words via lattice-valued finite state automata and the language accepted by lattice-valued finite automata
然后,給出了基于格值有限狀態(tài)自動(dòng)機(jī)的數(shù)值計(jì)算的形式模型。同時(shí),建立了輸入是詞的格值有限狀態(tài)自動(dòng)機(jī)的轉(zhuǎn)移函數(shù)以及格值有限狀態(tài)自動(dòng)機(jī)所接收的語言的定義。 - according to the theory of continuous-time markov chains, given a g-matrix q, it is possible that there exist infinite transition functions and therefore there maybe exist infinite positive contraction semigroups ( co semigroups ) on l1 derived from q-matrix q . but each positive contraction semigroup has and only has one infinitesimal generator
給定一個(gè)q-矩陣q，可能存在無窮多個(gè)轉(zhuǎn)移函數(shù)，從而在l1空間上可能有無窮多個(gè)正的壓縮半群(c_0半群)與之對(duì)應(yīng)，而每個(gè)正的壓縮半群有且僅有一個(gè)無窮小生成元。
更多例句： 下一頁